n=int(input())
a=[int(i) for i in input().split()]
min_sum=360
for i in range(n):
for j in range(i+1,n):
min_sum=min(min_sum,max(360-2*sum(a[i:j]),2*sum(a[i:j])-360))
print(min_sum)#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define hello() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define nl '\n'
#define elif else if
#define pb push_back
#define mod 1000000007
#define cntbit __builtin_popcount
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/__gcd(a,b)
int main()
{
hello();
int n;
cin>>n;
int arr[n+2];
for(int i=1; i<=n; i++)
cin>>arr[i];
int ans=360;
int sum=0;
for(int i=1; i<=n; i++)
{
sum=0;
for(int j=i; j<n; j++)
{
sum+=arr[j];
ans=min(ans,abs(360-(2*sum)));
}
}
cout<<ans<<endl;
}
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |
938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |
221. Maximal Square | 1200. Minimum Absolute Difference |
1619B - Squares and Cubes | 1619A - Square String |
1629B - GCD Arrays | 1629A - Download More RAM |
1629C - Meximum Array | 1629D - Peculiar Movie Preferences |
1629E - Grid Xor | 1629F1 - Game on Sum (Easy Version) |
2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |